package PriorityQueue;

public class ListNode implements Priority{

    Node head;
     class Node {
        public Node next;
        public int value;

        public Node(Node next, int value) {
            this.next = next;
            this.value = value;
        }

        public Node() {
        }
    }

    public ListNode() {
        head = new Node(null,-1);
    }

    @Override
    public int priority() {
        return 0;
    }


}
